Automated NMR Resonance Assignment
ثبت نشده
چکیده
The overview of Autolink. The overview of Autolink is shown in Figure 1. The input data are spin systems obtained from CARA [2]. All possible spin system parings are considered and a “fitness” score is computed for each pair. A pair of spin systems and their fitness score form a “link hypothesis”. Each fitness score consists of several sub-scores representing specific resonance comparisons, such as the comparison of Cα spin of one spin system with the Cα−1 spin of another spin system, the comparison of the Cβ and Cβ−1 spins of spin systems, etc. All link hypotheses form a list of potential spin system links, called the “priority list”, which is regarded as the input of the next step, “hypothesis evaluation/re-evaluation” cycles. In hypothesis evaluation/re-evaluation cycles, some link hypotheses are accepted for the assignment of their spin systems to some regions of the protein sequence, and some link hypotheses are rejected from the candidate list. After that, the link hypotheses fitness scores are modified by factors that are dependent on the acceptance or rejection of other link hypotheses. The process
منابع مشابه
Automated Protein NMR Resonance Assignments
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protein sequence, providing the prerequisite for establishing intra- and inter-residue spatial relationships between atoms. The assignment process is tedious and time-consuming, which could take many weeks. Though there exis...
متن کاملInteger Programming Model for Automated Structure-based NMR Assignment
We introduce the “Automated Structure-based Assignment" problem: Given a reference 3D structure, a protein sequence, and its NMR spectra, automatically interpret the NMR spectra and do backbone resonance assignment. We then propose a solution to solve this problem. The core of the solution is a novel integer linear programming model, which is a general framework for many versions of the structu...
متن کاملTowards Automated Structure-based NMR Assignment
We introduce the “Automated Structure-based Assignment” problem: Given a reference 3D structure, a protein sequence, and its NMR spectra, automatically interpret the NMR spectra and do backbone resonance assignment. We then propose a solution to solve this problem. The core of the solution is a novel integer linear programming model, which is a general framework for many versions of the structu...
متن کاملAPART: Automated Preprocessing for NMR Assignments with Reduced Tedium
MOTIVATION High-throughput NMR structure determination is a goal that will require progress on many fronts, one of which is rapid resonance assignment. An important rate-limiting step in the resonance assignment process is accurate identification of resonance peaks in the NMR spectra. Peak-picking schemes range from incomplete (which lose essential assignment connectivities) to noisy (which obs...
متن کاملTowards Automated Structure-Based NMR Resonance Assignment
We propose a general framework for solving the structurebased NMR backbone resonance assignment problem. The core is a novel 0-1 integer programming model that can start from a complete or partial assignment, generate multiple assignments, and model not only the assignment of spins to residues, but also pairwise dependencies consisting of pairs of spins to pairs of residues. It is still a chall...
متن کاملStatistical evaluation of NMR backbone resonance assignment
This paper proposes a novel statistical evaluation model for automated protein NMR sequential resonance assignment. It can be bound to any assignment program and provides confidences for the whole output assignment and each individual mapping. A simulation study on a set of four proteins shows that the statistical evaluation results are informative.
متن کامل